On the Optimal Compression of Sets in PSPACE
نویسنده
چکیده
We show that if DTIME[2] is not included in DSPACE[2], then, for every set B in PSPACE, all strings x in B of length n can be represented by a string compressed(x) of length at most log(|B|) + O(logn), such that a polynomial-time algorithm, given compressed(x), can distinguish x from all the other strings in B. Modulo the O(logn) additive term, this achieves the information-theoretical optimum for string compression.
منابع مشابه
A Framework for Optimal Attribute Evaluation and Selection in Hesitant Fuzzy Environment Based on Enhanced Ordered Weighted Entropy Approach for Medical Dataset
Background: In this paper, a generic hesitant fuzzy set (HFS) model for clustering various ECG beats according to weights of attributes is proposed. A comprehensive review of the electrocardiogram signal classification and segmentation methodologies indicates that algorithms which are able to effectively handle the nonstationary and uncertainty of the signals should be used for ECG analysis. Ex...
متن کاملOptimal Self-healing of Smart Distribution Grids Based on Spanning Trees to Improve System Reliability
In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...
متن کاملApplication of Interval-valued Fuzzy Analytic Hierarchy Process Approach in Selection Cargo Terminals, a Case Study
Cargo terminals are the gateways for entrance of commodities into the transportation network. Therefore, locating them in optimal location could have a major impact on the cost effectiveness and efficiency of transport, traffic safety and reduction in environmental pollutions. Due to the presence of a large number of parameters involved and the existing uncertainties, decision making in this fi...
متن کاملExploiting Structure to Efficiently Solve Large Scale
Exploiting Structure to Efficiently Solve Large Scale Partially Observable Markov Decision Processes Pascal Poupart Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2005 Partially observable Markov decision processes (POMDPs) provide a natural and principled framework to model a wide range of sequential decision making problems under uncertainty. To date, the u...
متن کاملThe compression of MPPT methods in small sized wind power plants
In this paper the maximum power point tracking (MPPT) algorithms for wind energy systems arereviewed. As the amounts of power produced in wind power plants is changing due to theinstantaneous changing nature of the wind, it is desirable to determine the one optimal generatorspeed that ensures maximum energy yield. Thus, it is important to include a controller that cantrack the maximum peak rega...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 18 شماره
صفحات -
تاریخ انتشار 2011